Hypergraph Ramsey numbers: Triangles versus cliques
نویسندگان
چکیده
منابع مشابه
Hypergraph Ramsey numbers: Triangles versus cliques
A celebrated result in Ramsey Theory states that the order of magnitude of the trianglecomplete graph Ramsey numbers R(3, t) is t/ log t. In this paper, we consider an analogue of this problem for uniform hypergraphs. A triangle is a hypergraph consisting of edges e, f, g such that |e∩ f | = |f ∩ g| = |g ∩ e| = 1 and e ∩ f ∩ g = ∅. For all r ≥ 2, let R(C3,K t ) be the smallest positive integer ...
متن کاملHypergraph Ramsey numbers: tight cycles versus cliques
For s ≥ 4, the 3-uniform tight cycle C s has vertex set corresponding to s distinct points on a circle and edge set given by the s cyclic intervals of three consecutive points. For fixed s ≥ 4 and s 6≡ 0 (mod 3) we prove that there are positive constants a and b with 2 < r(C s ,K 3 t ) < 2 bt log . The lower bound is obtained via a probabilistic construction. The upper bound for s > 5 is proved...
متن کاملRamsey numbers of cubes versus cliques
The cube graph Qn is the skeleton of the n-dimensional cube. It is an n-regular graph on 2 n vertices. The Ramsey number r(Qn,Ks) is the minimum N such that every graph of order N contains the cube graph Qn or an independent set of order s. In 1983, Burr and Erdős asked whether the simple lower bound r(Qn,Ks) ≥ (s − 1)(2n − 1) + 1 is tight for s fixed and n sufficiently large. We make progress ...
متن کاملHypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that every red-blue coloring of the k-tuples of an N -element set contains either a red set of size s or a blue set of size n, where a set is called red (blue) if all k-tuples from this set are red (blue). In this paper we obtain new estimates for several basic hypergraph Ramsey problems. We give a new upper bound for rk(s, n) for k ≥ 3 and s fix...
متن کاملOff-diagonal hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that every red-blue coloring of the k-subsets of {1, . . . , N} contains a red set of size s or a blue set of size n, where a set is red (blue) if all of its k-subsets are red (blue). A k-uniform tight path of size s, denoted by Ps, is a set of s vertices v1 < · · · < vs in Z, and all s−k+1 edges of the form {vj , vj+1, . . . , vj+k−1}. Let rk(Ps...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2013
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2013.04.009